Each regular code is included in a maximal regular code

Transmutation of Regular Expression to Source Code Using Code Generators

Because of the great possibility to make mistakes while dealing with the Automata, and programming and resolving problems within automata theory as it is a complex process, time consuming and still the results may not be reliable, various tools technologies and approaches are present today which significantly reduce complexity and increase productivity of dealing with regular languages in a ver...

Projective maximal submodules of extending regular modules

We show  that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. Hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. As aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. This generalizes and simplifies a result of  Dung and   Smith. As another consequen...

The Code of a Regular Generalized Quadrangle of Even Order

Yet Another Distance-Regular Graph Related to a Golay Code

We describe a new distance-regular, but not distance-transitive, graph. This graph has intersection array {110, 81, 12; 1, 18, 90}, and automorphism group M22: 2. In [1], Brouwer, Cohen and Neumaier discuss many distance-regular graphs related to the famous Golay codes. In this note, we describe yet another such graph. Ivanov, Linton, Lux, Saxl and the author [4] have classified all primitive d...

An O(n 2 ) Time Algorithm for Deciding Whether a Regular Language Is a Code

We describe an algorithm that, given as input a nondeterministic nite automaton A of size n, decides in O(n 2) time whether the language accepted by A is a code. Let be a nite alphabet. A language is a code if every string in is written uniquely as a concatenation of strings from , or, equivalently , if is a free submonoid of and is its minimal generating set.